Global optimization of rational functions: a semidefinite programming approach
نویسندگان
چکیده
منابع مشابه
Global optimization of rational functions: a semidefinite programming approach
We consider the problem of global minimization of rational functions on IR (unconstrained case), and on an open, connected, semi-algebraic subset of IR, or the (partial) closure of such a set (constrained case). We show that in the univariate case (n = 1), these problems have exact reformulations as semidefinite programming (SDP) problems, by using reformulations introduced in the PhD thesis of...
متن کاملA Semidefinite Programming approach for minimizing ordered weighted averages of rational functions
This paper considers the problem of minimizing the ordered weighted average (or ordered median) function of finitely many rational functions over compact semi-algebraic sets. Ordered weighted averages of rational functions are not, in general, neither rational functions nor the supremum of rational functions so that current results available for the minimization of rational functions cannot be ...
متن کاملGlobal Optimization of Rational Multivariate Functions
The paper deals with unconstrained global minimization of rational functions. A necessary condition is given for the function to have a nite innmum. In case the condition is satissed, the problem is shown to be equivalent to a speciic constrained polynomial optimization problem. In this paper, we solve a relaxation of the latter formulation using semi-deenite programming. In general, the relaxa...
متن کاملOptimization of Network Traffic Measurement : A Semidefinite Programming Approach
1. Abstract We study the problem of traffic matrix estimation in large IP networks. The problem of inferring the traffic for each (origin destination) pair in the network from the link measurements has been widely studied over the past 10 years. Recently, the possibility of using network-monitoring tools such as Netflow (cisco Systems) has renewed the interest for this problem, the aim being no...
متن کاملConvergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems
In this paper, we consider a bilevel polynomial optimization problem where the objective and the constraint functions of both the upper and the lower level problems are polynomials. We present methods for finding its global minimizers and global minimum using a sequence of semidefinite programming (SDP) relaxations and provide convergence results for the methods. Our scheme for problems with a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2005
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-005-0589-0